Dill: An Algorithm and a Symbolic Software Package for Doing Classical Supersymmetry Calculations

نویسنده

  • Vladan Luc̆ić
چکیده

An algorithm is presented that formalizes different steps in a classical Supersymmetric (SUSY) calculation. Based on the algorithm Dill, a symbolic software package, that can perform the calculations, is developed in the Mathematica programming language. While the algorithm is quite general, the package is created for the 4 − D, N = 1 model. Nevertheless, with little modification, the package could be used for other SUSY models. The package has been tested and some of the results are presented. The work was supported in part by DOE grant no. DE-FG02-85ER40233

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic Computing with Grassman Variables

A package of Maple 5.3 commands for doing calculations with anticommutative variables is presented. (Submitted to Journal of Symbolic Computation) Departamento de F́ısica Teórica, IF-UERJ. E-mail: [email protected].

متن کامل

A New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining

Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...

متن کامل

Maple+GrTensorII libraries for cosmology

The article mainly presents some results in using MAPLE platform for computer algebra (CA) and GrTensorII package in doing calculations for theoretical and numerical cosmology. AMS Subject Classification: 68W30, 83C05, 85A40

متن کامل

A Symbolic-Numeric Software Package for the Computation of the GCD of Several Polynomials

This survey is intended to present a package of algorithms for the computation of exact or approximate GCDs of sets of several polynomials and the evaluation of the quality of the produced solutions. These algorithms are designed to operate in symbolic-numeric computational environments. The key of their effectiveness is the appropriate selection of the right type of operations (symbolic or num...

متن کامل

A symbolic-numeric algorithm for genus computation

The genus computation problem is a classical subject in computer algebra. Presently, several symbolic algorithms are available for computing the genus of plane algebraic curves over an algebraically closed field, see [16, 18, 31]. There exist also good implementations for these algorithms in several packages of some well-known computer algebra systems such as: Maple, Magma, Singular, Axiom. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994